#include <iostream>
#include <cstring>

using namespace std;
const int N = 100010;
int idx, d[N], h[N], ne[N], e[N];
int q[N];
int hh = 0, tt = -1;
int n, m;
void add(int a, int b)
{
    e[idx] = b;
    ne[idx] = h[a];
    h[a] = idx++;
}

bool topsort()
{
    for (int i = 1; i <= n; ++i)
    {
        if (d[i] == 0)
        {
            q[++tt] = i;
        }
    }

    while (hh <= tt)
    {
        int t = q[hh++];
        for (int i = h[t]; i != -1; i = ne[i])
        {
            int j = e[i];
            d[j]--;
            if (d[j] == 0)
            {
                q[++tt] = d[j];
            }
        }
    }
    if (tt == n - 1)
    {
        return true;
    }
    return false;
}
int main()
{
    memset(h, -1, sizeof(h));
    cin >> n >> m;
    while (m--)
    {
        int a, b;
        scanf("%d %d", &a, &b);
        add(a, b);
        d[b]++;
    }

    if (topsort())
    {
        for (int i = 0; i < tt; ++i)
        {
            printf("%d ", q[i]);
        }
    }
    else
    {
        puts("-1");
    }
    return 0;
}